Double stranded smoothing technique in energy minimization problems
نویسندگان
چکیده
In this study, we propose a new algorithm for image denoising by using double stranded Bezier curves based smoothing technique. The is developed to solve energy minimization problems with non-smooth total variation norm (TV). In order demonstrate the efficiency of apply it some numerical examples. experimental results are reported and they compared obtained from TV hyperbolic standard algorithm.
منابع مشابه
A Parallel Smoothing Technique for Parabolic Problems
A method is examined to approximate the interface conditions for Chebyshev polynomial approximations to the solutions of parabolic problems, and a smoothing technique is used to calculate the interface conditions for a domain decomposition method. The method uses a polynomial of one less degree than the full approximation to calculate the rst derivative so that interface values can be calculate...
متن کاملSmoothing technique for nonsmooth composite minimization with linear operator
We introduce and analyze an algorithm for the minimization of convex functions that are the sum of differentiable terms and proximable terms composed with linear operators. The method builds upon the recently developed smoothed gap technique. In addition to a precise convergence rate result, valid even in the presence of linear inclusion constraints, this new method allows an explicit treatment...
متن کاملEfficient MRF Energy Minimization via Adaptive Diminishing Smoothing
We consider the linear programming relaxation of an energy minimization problem for Markov Random Fields. The dual objective of this problem can be treated as a concave and unconstrained, but non-smooth function. The idea of smoothing the objective prior to optimization was recently proposed in a series of papers. Some of them suggested the idea to decrease the amount of smoothing (so called te...
متن کاملDouble smoothing technique for infinite-dimensional optimization problems with applications to optimal control
In this paper, we propose an efficient technique for solving some infinite-dimensional problems over the sets of functions of time. In our problem, besides the convex point-wise constraints on state variables, we have convex coupling constraints with finite-dimensional image. Hence, we can formulate a finite-dimensional dual problem, which can be solved by efficient gradient methods. We show th...
متن کاملA Double Smoothing Technique for Constrained Convex Optimization Problems and Applications to Optimal Control
In this paper, we propose an efficient approach for solving a class of convex optimization problems in Hilbert spaces. Our feasible region is a (possibly infinite-dimensional) simple convex set, i.e. we assume that projections on this set are computationally easy to compute. The problem we consider is the minimization of a convex function over this region under the additional constraint Au ∈ T ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algebra, Control and Optimization
سال: 2022
ISSN: ['2155-3297', '2155-3289']
DOI: https://doi.org/10.3934/naco.2022022